On P-Immunity of Exponential Time Complete Sets
نویسندگان
چکیده
منابع مشابه
On P-Immunity of Nondeterministic Complete Sets
We show that every m-complete set for NEXP as well as ats complement have an infinite subset in P. Thw nnswers an open question first raised in [Ber76].
متن کاملStrong Reductions and Immunity for Exponential Time
This paper investigates the relation between immunity and hardness in exponential time. The idea that these concepts are related originated in computability theory where it led to Post’s program, and it has been continued successfully in complexity theory [9, 13, 20]. We study three notions of immunity for exponential time. An infinite set A is called • EXP-immune, if it does not contain an inf...
متن کاملA Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/Poy
In this paper we study the interplay between three measures of polynomial time behavior in sets: p-cheatability, p-closeness, and membership in P/poly. First we construct (2“ 1 for k) p-cheatable sets that are bi-immune with respect to all recursively enumerable sets. We show that the constructed sets are in P/poly, but can be constructed so that they are not p-close. In fact, they can be const...
متن کاملCTL+ Is Complete for Double Exponential Time
We show that the satisfiability problem for CTL, the branching time logic that allows boolean combinations of path formulas inside a path quantifier but no nesting of them, is 2-EXPTIME-hard. The construction is inspired by Vardi and Stockmeyer’s 2-EXPTIME-hardness proof of CTL∗’s satisfiability problem. As a consequence, there is no subexponential reduction from CTL to CTL which preserves sati...
متن کاملExponential Time Complexity of Weighted Counting of Independent Sets
We consider weighted counting of independent sets using a rational weight x: Given a graph with n vertices, count its independent sets such that each set of size k contributes xk. This is equivalent to computation of the partition function of the lattice gas with hard-core self-repulsion and hard-core pair interaction. We show the following conditional lower bounds: If counting the satisfying a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1997
ISSN: 0022-0000
DOI: 10.1006/jcss.1997.1488